First-Order Modal Logic Theorem Proving and Functional Simulation

We propose a t rans la t ion approach f r o m moda l logics to f i rst-order predicate logic which combines advantages f r o m b o t h , the (s tandard) rela t iona l t rans la t ion and the ( rather compact) func t iona l t rans la t ion m e t h o d and avoids many of their respective disadvantages (exponent ia l g row th versus equal i ty hand l ing ) . In par t i cu la r in the app l ica t ion to serial m o d a l logics i t al lows considerable s impl i f icat ions such t h a t of ten even a s imple u n i t clause suffices in order to express the accessibil i ty re la t ion properties.